Resolution, Inverse Method and the Sequent Calculus
نویسنده
چکیده
We discuss the general scheme of building resolution calculi (also called the inverse method) originating from S. Maslov and G. Mints. A survey of resolution calculi for various nonclassical logic is presented, along with several common properties these calculi possess.
منابع مشابه
The Inverse Method for the Logic of Bunched Implications
The inverse method, due to Maslov, is a forward theorem provingmethod for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic with multiplicative linear conjunction and its adjoint implication. We present the first formulation of an inver...
متن کاملEquality Elimination for the Inverse Method and Extension Procedures
We demonstrate how to handle equality in the inverse method using equality elimination. In the equality elimination method, proofs consist of two parts. In the first part we try to solve equations obtaining so called solution clauses. Solution clauses are obtained by a very refined strategy — basic superposition with selection function. In the second part, we perform the usual sequent proof sea...
متن کاملThe Inverse Method for Many-Valued Logics
We define an automatic proof procedure for finitely manyvalued logics given by truth tables. The proof procedure is based on the inverse method. To define this procedure, we introduce so-called introduction-based sequent calculi. By studying proof-theoretic properties of these calculi we derive efficient validityand satisfiability-checking procedures based on the inverse method. We also show ho...
متن کاملAutomata, Resolution, and Cut-elimination
Automata, Resolution, and Cut-elimination are three methods to prove the decidability of provability in various logics. The goal of this paper is to understand the relation between these three methods, using Alternating pushdown systems as a unifying example. To this aim, we propose a new Resolution based saturation method for Polarized sequent calculus modulo theory and its associated cut-elim...
متن کاملHow to Synthesize a Tableau
We synthesize a refutationally complete tableau calculus for propositional logic by a new method, using ordered resolution as a procedural framework at the meta level. Algebraically, the calculus solves the word problem for free distributive lattices. Goal-directedness of the construction is enforced by a ne-tuned well-founded ordering on terms, atoms and clauses. The synthesis is performed in ...
متن کامل